An application-level implementation of causal timestamps and causal ordering
نویسنده
چکیده
Maintenance of causality information in distributed systems has previously been implemented in the communications infrastructure with the focus on providing reliability and availability for distributed services. While this approach has a number of advantages, moving causality information up into the view and control of the application programmer is useful, and in some cases, preferable. In an experiment at the University of Queensland, libraries to support application-level maintenance of causality information have been implemented. The libraries allow the collection and use of causality information under programmer control, supplying a basis for making causal dependency information available for application management and troubleshooting. The libraries are also unique in suppomng existing distributed systems based on the remote procedure call paradigm. This paper describes the underlying theory of causality, and the design and implementation of the libraries. An event reporting service example is used to motivate the approach, and a number of previously unresolved practical problems are addressed in the design process.
منابع مشابه
Global Causal Ordering with Minimal Latency
Causally order delivery of messages is a useful property for coordinating the activities of processors in a distributed system and for maintaining the consistency of replicated information. Timestamps in the messages can be used to impose a causal order on the delivery of messages using logical clocks or physical clocks. However, systems based on logical clocks experience a latency to message d...
متن کاملShrinking Timestamp Sizes of Event Ordering Protocols
Almost all published work on causal ordering mechanisms assumes theoretically unbounded counters for timestamps, thus ignoring the real-world problem that arises if one is actually interested in an operable implementation, since unbounded counters simply cannot be realized. An argument for its justification often encountered states, that the counter size can be chosen such that counters practic...
متن کاملConsistency Models in Distributed Systems with Physical Clocks
Most existing distributed systems use logical clocks to order events in the implementation of various consistency models. Although logical clocks are straightforward to implement and maintain, they may affect the scalability, availability, and latency of the system when being used to totally order events in strong consistency models. They can also incur considerable overhead when being used to ...
متن کاملImplementing Causal Ordering with Bounded Time stamps
This paper investigates a solution to the problem of causal ordering in message passing distributed systems Causal ordering is the restriction that messages are delivered in a fo fashion with respect to the global causal order between events in the system This is stronger than the condition that each local channel is fo In our algorithm causal ordering is implemented by having each process main...
متن کاملA New Algorithm to Implement Causal Ordering
This paper presents a new algorithm to implement causal ordering. Causal ordering was first proposed in the ISIS system developed at Cornell University. The interest of causal ordering in a distr ibuted system is that it is cheaper to realize than total ordering. The implementation of causal ordering proposed in this paper uses logical clocks of Mat te rn-Fidge (which define a partial order bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Distributed Systems Engineering
دوره 2 شماره
صفحات -
تاریخ انتشار 1995